Nuprl Lemma : w-es_wf 0,22

w:World, p:FairFifo. ES(w ES 
latex


DefinitionsTop, Type, t  T, x:AB(x), w.M, f(a), AtomFree(T;x), Id, x:AB(x), IdLnk, w.TA, x:AB(x), P & Q, w.T, <a,b>, w-atom-constraint(w), Void, x:AB(x), Unit, , FairFifo, P  Q, World, world-es-atom, E, s = t, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val), , b, A, {x:AB(x) }, world-es-val, xt(x), 1of(t), 2of(t), a(i;t), kind(a), x,yt(x;y), kindcase(ka.f(a); l,t.g(l;t) ), False, AB, , act(e), time(e), kind(e), P  Q, P  Q, {T}, SQType(T), V(i;k), val(e), Msg(M), S  T, type List, Knd, S  T, w-automaton(T;TA;M), w-machine(w;i), vartype(i;x), #$n, a<b, s(i;t).x, w-pred(w;e), left+right, kind(e), EOrderAxioms(Epred?info), pred!(e;e'), SWellFounded(R(x;y)), first(e), w-order-axioms, strong-subtype(A;B), isnull(a), Prop, EqDecider(T), NatDeq, IdDeq, product-deq(A;B;a;b), ES(the_w), ES, loc(e), w-info(w;e), x.A(x), loc(e), s ~ t
Lemmasdeq wf, product-deq wf, id-deq wf, nat-deq wf, strong-subtype-deq-subtype, strong-subtype-set3, w-isnull wf, strong-subtype-self, EOrderAxioms wf, not wf, assert wf, first wf, w-order-axioms, kind wf, loc wf, unit wf, val-axiom wf, w-pred wf, w-info wf, w-s wf, le wf, w-machine wf, w-automaton wf, Msg wf, Knd wf, w-eval wf, Id sq, w-loc-lemma, w-loc wf, w-kind-lemma, subtype rel self, kindcase wf, w-kind wf, w-a wf, pi2 wf, pi1 wf, nat wf, world-es-val, w-E wf, world-es-atom, world wf, fair-fifo wf, w-atom-constraint wf, it wf, w-T wf, w-TA wf, IdLnk wf, Id wf, atom-free wf, w-M wf, top wf

origin